A piecewise polynomial lacunary interpolation method
نویسندگان
چکیده
منابع مشابه
Complete parameterization of piecewise-polynomial interpolation kernels
Every now and then, a new design of an interpolation kernel appears in the literature. While interesting results have emerged, the traditional design methodology proves laborious and is riddled with very large systems of linear equations that must be solved analytically. We propose to ease this burden by providing an explicit formula that can generate every possible piecewise-polynomial kernel ...
متن کاملHermite interpolation by piecewise polynomial surfaces with polynomial area element
This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space R (where they are equivalent to the PN surfaces) and in the Minkowski space R (where they provide the MOS surfaces). We show generally in real vector spaces of any dimension and any metric that the Gram determinant of a parametr...
متن کاملGeneralization of the Piecewise Polynomial Interpolation by Fractal Functions
The fractal interpolation functions defined by iterated function systems provide new methods of approximation and quantification of experimental data. The polynomial fractal functions can be considered as generalization of the piecewise polynomial interpolants. Assuming some hypotheses on the original function, a bound of the representation of the error for this kind of approximants is obtained...
متن کاملPiecewise polynomial interpolation in Muckenhoupt weighted Sobolev spaces and applications
We develop a constructive piecewise polynomial approximation theory in 1 weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The 2 main ingredients to derive optimal error estimates for an averaged Taylor polynomial 3 are a suitable weighted Poincaré inequality, a cancellation property and a simple 4 induction argument. We also construct a quasi-interpolation operator, b...
متن کاملInterpolation of Shifted-Lacunary Polynomials [Extended Abstract]
Given a “black box” function to evaluate an unknown rational polynomial f ∈ Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity t ∈ Z>0, the shift α ∈ Q, the exponents 0 ≤ e1 < e2 < · · · < et, and the coefficients c1, . . . , ct ∈ Q \ {0} such that f (x) = c1(x − α)1 + c2(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1986
ISSN: 0021-9045
DOI: 10.1016/0021-9045(86)90012-2